Monte Carlo optimization approach for decentralized estimation networks under communication constraints

We consider designing decentralized estimation schemes over bandwidth limited communication links with a particular interest in the tradeoff between the estimation accuracy and the cost of communications due to, e.g., energy consumption. We take two classes of in–network processing strategies into account which yield graph representations through modeling the sensor platforms as the vertices and the communication links by edges as well as a tractable Bayesian risk that comprises the cost of transmissions and penalty for the estimation errors. This approach captures a broad range of possibilities for “online” processing of observations as well as the constraints imposed and enables a rigorous design setting in the form of a constrained optimization problem. Similar schemes as well as the structures exhibited by the solutions to the design problem has been studied previously in the context of decentralized detection. Under reasonable assumptions, the optimization can be carried out in a message passing fashion. We adopt this framework for estimation, however, the corresponding optimization schemes involve integral operators that cannot be evaluated exactly in general. We develop an approximation framework using Monte Carlo methods and obtain particle representations and approximate computational schemes for both classes of in–network processing strategies and their optimization. The proposed Monte Carlo optimization procedures operate in a scalable and efficient fashion and, owing to the non-parametric nature, can produce results for any distributions provided that samples can be produced from the marginals. In addition, this approach exhibits graceful degradation of the estimation accuracy asymptotically as the communication becomes more costly, through a parameterized Bayesian risk

Sparsity-driven sparse-aperture ultrasound imaging

We propose an image formation algorithm for ultrasound imaging based on sparsity-driven regularization functionals. We consider data collected by synthetic transducer arrays, with the primary motivating application being nondestructive evaluation. Our framework involves the use of a physical optics-based forward model of the observation process; the formulation of an optimization problem for image formation; and the solution of that problem through efficient numerical algorithms. Our sparsity-driven, model-based approach achieves the preservation of physical features while suppressing spurious artifacts. It also provides robust reconstructions in the case of sparse observation apertures. We demonstrate the effectiveness of our imaging strategy on real ultrasound data

Monte Carlo optimization of decentralized estimation networks over directed acyclic graphs under communication constraints

Motivated by the vision of sensor networks, we consider decentralized estimation networks over bandwidth–limited communication links, and are particularly interested in the tradeoff between the estimation accuracy and the cost of communications due to, e.g., energy consumption. We employ a class of in–network processing strategies that admits directed acyclic graph representations and yields a tractable Bayesian risk that comprises the cost of communications and estimation error penalty. This perspective captures a broad range of possibilities for processing under network constraints and enables a rigorous design problem in the form of constrained optimization. A similar scheme and the structures exhibited by the solutions have been previously studied in the context of decentralized detection. Under reasonable assumptions, the optimization can be carried out in a message passing fashion. We adopt this framework for estimation, however, the corresponding optimization scheme involves integral operators that cannot be evaluated exactly in general. We develop an approximation framework using Monte Carlo methods and obtain particle representations and approximate computational schemes for both the in–network processing strategies and their optimization. The proposed Monte Carlo optimization procedure operates in a scalable and efficient fashion and, owing to the non-parametric nature, can produce results for any distributions provided that samples can be produced from the marginals. In addition, this approach exhibits graceful degradation of the estimation accuracy asymptotically as the communication becomes more costly, through a parameterized Bayesian risk

Sparsity-driven image formation and space-variant focusing for SAR

In synthetic aperture radar (SAR) imaging, the presence of moving targets in the scene causes phase errors in the SAR data and subsequently defocusing in the formed image. The defocusing caused by the moving targets exhibits space-variant characteristics, i.e., the defocusing arises only in the parts of the image containing the moving targets, whereas the stationary background is not defocused. Considering that the reflectivity field to be imaged usually admits sparse representation, we propose a sparsity-driven method for joint SAR imaging and removing the defocus caused by moving targets. The method is performed in a nonquadratic regular-ization based framework by solving an optimization problem, in which prior information about both the scene and phase errors are incorporated as constraints

A sparsity-driven approach for joint SAR imaging and phase error correction

Image formation algorithms in a variety of applications have explicit or implicit dependence on a mathematical model of the observation process. Inaccuracies in the observation model may cause various degradations and artifacts in the reconstructed images. The application of interest in this paper is synthetic aperture radar (SAR) imaging, which particularly suffers from motion-induced model errors. These types of errors result in phase errors in SAR data which cause defocusing of the reconstructed images. Particularly focusing on imaging of fields that admit a sparse representation, we propose a sparsity-driven method for joint SAR imaging and phase error correction. Phase error correction is performed during the image formation process. The problem is set up as an optimization problem in a nonquadratic regularization-based framework. The method involves an iterative algorithm each iteration of which consists of consecutive steps of image formation and model error correction. Experimental results show the effectiveness of the approach for various types of phase errors, as well as the improvements it provides over existing techniques for model error compensation in SAR

SAR moving target imaging using group sparsity

SAR imaging of scenes containing moving targets results in defocusing in the reconstructed images if the SAR observation model used in imaging does not take the motion into account. SAR data from a scene with motion can be viewed as data from a stationary scene, but with phase errors due to motion. Based on this perspective, we formulate the moving target SAR imaging problem as one of joint imaging and phase error compensation. Based on the assumption that only a small percentage of the entire scene contains moving targets, phase errors exhibit a group sparse nature, when the entire data for all the points in the scene are handled together. Considering this structure of motion-related phase errors and that many scenes of interest admit sparse representation in SAR imaging, we solve this joint problem by minimizing a cost function which involves two nonquadratic regularization terms one of which is used to enforce the sparsity of the reflectivity field to be imaged and the other is used to exploit the group sparse nature of the phase errors

Region-enhanced passive radar imaging

The authors adapt and apply a recently-developed region-enhanced synthetic aperture radar (SAR) image reconstruction technique to the problem of passive radar imaging. One goal in passive radar imaging is to form images of aircraft using signals transmitted by commercial radio and television stations that are reflected from the objects of interest. This involves reconstructing an image from sparse samples of its Fourier transform. Owing to the sparse nature of the aperture, a conventional image formation approach based on direct Fourier transformation results in quite dramatic artefacts in the image, as compared with the case of active SAR imaging. The regionenhanced image formation method considered is based on an explicit mathematical model of the observation process; hence, information about the nature of the aperture is explicitly taken into account in image formation. Furthermore, this framework allows the incorporation of prior information or constraints about the scene being imaged, which makes it possible to compensate for the limitations of the sparse apertures involved in passive radar imaging. As a result, conventional imaging artefacts, such as sidelobes, can be alleviated. Experimental results using data based on electromagnetic simulations demonstrate that this is a promising strategy for passive radar imaging, exhibiting significant suppression of artefacts, preservation of imaged object features, and robustness to measurement noise

Hidden conditional random fields for classification of imaginary motor tasks from EEG data

Brain-computer interfaces (BCIs) are systems that allow the control of external devices using information extracted from brain signals. Such systems find application in rehabilitation of patients with limited or no muscular control. One mechanism used in BCIs is the imagination of motor activity, which produces variations on the power of the electroencephalography (EEG) signals recorded over the motor cortex. In this paper, we propose a new approach for classification of imaginary motor tasks based on hidden conditional random fields (HCRFs). HCRFs are discriminative graphical models that are attractive for this problem because they involve learned statistical models matched to the classification problem; they do not suffer from some of the limitations of generative models; and they include latent variables that can be used to model different brain states in the signal. Our approach involves auto-regressive modeling of the EEG signals, followed by the computation of the power spectrum. Frequency band selection is performed on the resulting time-frequency representation through feature selection methods. These selected features constitute the data that are fed to the HCRF, parameters of which are learned from training data. Inference algorithms on the HCRFs are used for classification of motor tasks. We experimentally compare this approach to the best performing methods in BCI competition IV and the results show that our approach overperforms all methods proposed in the competition. In addition, we present a comparison with an HMM-based method, and observe that the proposed method produces better classification accuracy

Semi-blind sparse channel estimation with constant modulus symbols

We propose two methods for the estimation of sparse communication channels. In the first method, we consider the problem of channel estimation based on training symbols, and formulate it as an optimization problem. In this formulation, we combine the objective of fidelity to the received data with a non-quadratic constraint reflecting the prior information about the sparsity of the channel. This approach leads to accurate channel estimates with much shorter training sequences than conventional methods. The second method we propose is aimed at taking advantage of any available training-based data, as well as any "blind" data based on unknown, constant modulus symbols. We propose a semi-blind optimization framework making use of these two types of data, and enforcing the sparsity of the channel, as well as the constant modulus property of the symbols. This approach improves upon the channel estimates based only on training sequences, and also produces accurate estimates for the unknown symbols

Modeling differences in the time-frequency representation of EEG signals through HMM’s for classification of imaginary motor tasks

Brain Computer interfaces are systems that allow the control of external devices using the information extracted from the brain signals. Such systems find applications in rehabilitation, as an alternative communication channel and in multimedia applications for entertainment and gaming. In this work, a new approach based on the Time-Frequency (TF) distribution of the signal power, obtained by autoregressive methods and the use Hidden Markov models (HMM) is developed. This approach take into account the changes of power on different frequency bands with time. For that purpose HMM’s are used to modeling the changes in the power during the execution of two different motor tasks. The use of TF methods involves a problem related to the selection of the frequency bands that can lead to over fitting (due to the course of dimensionality) as well as problems related to the selection of the model parameters. These problems are solved in this work by combining two methods for feature selection: Fisher Score and Sequential Floating Forward Selection. The results are compared to the three top results of the BCI competition IV. It is shown here that the proposed method over perform those other methods in four subjects and the average over all the subjects equals the one obtained by the winner algorithm of the competition